Simulating Turing machines using switching map systems

This report describes research carried out during a final year B.Sc. research project. The research is based on the work of Moore and Sato. A function converts Turing machines into switching baker’s maps. The theory of switching baker’s maps and the converter function are both explained and adapted. A switching baker’s map simulator is implemented and used to recognise a number of languages in the Chomsky hierarchy. The computation path of the switching baker’s map simulator is graphically represented and output patterns are examined.